Artificial Dasein: Solving the Frame Problem with Incremental Contextualization
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the Frame Problem
Murray Shanahan has been actively involved in research on the frame problem since the late eighties. When a scientist looks back at the past of his eld, including his own early work, he can see how poorly the subject was understood years ago, and then two attitudes are possible. One is to think: It's amazing how naive and confused we used to be; much of this work should have never appeared in p...
متن کاملSolving the Incremental Satisfiabili’iy Problem
D Given a set of clauses in propositional logic that have been found satisfiable, we wish to check whether satisfiability is preserved when the clause set is incremented with a new clause. We describe an efficient implementation of the Davis-Putnam-Loveland algorithm for checking the satisfiability of the original set. We then show how to modify the algorithm for efficient solution of the incre...
متن کاملSolving the incremental satisfiability problem
Given a set of clauses in propositional logic that have been found satis able we wish to check whether satis ability is preserved when the clause set is incremented with a new clause We describe an e cient implementation of the Davis Putnam Loveland algorithm for checking satis ability of the original set We then show how to modify the algorithm for e cient solution of the incremental problem w...
متن کاملBias-Optimal Incremental Problem Solving
Given is a problem sequence and a probability distribution (the bias) on programs computing solution candidates. We present an optimally fast way of incrementally solving each task in the sequence. Bias shifts are computed by program prefixes that modify the distribution on their suffixes by reusing successful code for previous tasks (stored in non-modifiable memory). No tested program gets mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OALib
سال: 2018
ISSN: 2333-9721,2333-9705
DOI: 10.4236/oalib.1104535